My research explores the limits of efficient computation. I study what can be achieved with limited resources, such as limited time, memory, and communication. In particular, my focus in on what cannot be achived: I try to delineate which problems cannot possibly be solved using limited resources, not even by future algorithms we haven't thought of yet, and my goal is to prove this mathematically and rigorously.
In technical terms, much of my work lies in the intersection of lower bounds, algorithms, and pseudorandomness. More information appears here and here.
I'm an Assistant Professor at the University of Toronto. I'm part of the Theory Group in the Department of Computer Science.
I'm available at {firstname}@cs.toronto.edu , and my office is at the Sandford Fleming building (SF3310).
Brief bio: I completed my PhD at the Theory Group at Weizmann, where I had the pleasure and good fortune to be advised by Prof. Oded Goldreich. As a postdoc I was part of Prof. Ryan Williams' wonderful group at MIT, I was hosted in the Institute for Advanced Study and DIMACS by Prof. Avi Wigderson, and I was a research fellow at the Simons Institute for the Theory of Computing.
As an undergrad, long ago when mighty dinosaurs roamed the Earth, I studied Psychology at TAU, Math at OpenU, and CS at the Technion.